Semilinear Sets, Register Machines, and Integer Vector Addition (P) Systems
نویسندگان
چکیده
1 Institute of Mathematics and Computer Science Academy of Sciences of Moldova Str. Academiei 5, Chişinău, MD 2028, Moldova E-mail: [email protected] 2 Dipartimento di Informatica, Sistemistica e Comunicazione Università degli Studi di Milano-Bicocca Viale Sarca 336/14, 20126 Milano, Italy E-mail: {o.belingheri@campus,porreca@disco,zandron@disco}.unimib.it 3 Faculty of Informatics, TU Wien Favoritenstraße 9-11, 1040 Vienna, Austria E-mail: [email protected] 4 Université Paris Est, France E-mail: [email protected]
منابع مشابه
Projections of Vector Addition System Reachability Sets are Semilinear
The reachability sets of Vector Addition Systems of dimension six or more can be non-semilinear. This may be one reason why the inclusion problem (as well as the equality problem) for reachability sets of vector addition systems in general is undecidable, even though the reachability problem itself is known to be decidable. We show that any one-dimensional projection of the reachability set of ...
متن کاملOn P Systems Operating in Sequential Mode
In the standard definition of a P system, a computation step consists of a parallel application of a “maximal” set of nondeterministically chosen rules. Referring to this system as a parallel P system, we consider in this paper a sequential P system, in which each step consists of an application of a single nondeterministically chosen rule. We show the following: 1. For 1-membrane catalytic sys...
متن کاملCatalytic P systems, semilinear sets, and vector addition systems
We look at 1-region membrane computing systems which only use rules of the form , where is a catalyst, is a noncatalyst, and is a (possibly null) string of noncatalysts. There are no rules of the form . Thus, we can think of these systems as “purely” catalytic. We consider two types: (1) when the initial configuration contains only one catalyst, and (2) when the initial configuration contains m...
متن کاملA QUADRATIC MARGIN-BASED MODEL FOR WEIGHTING FUZZY CLASSIFICATION RULES INSPIRED BY SUPPORT VECTOR MACHINES
Recently, tuning the weights of the rules in Fuzzy Rule-Base Classification Systems is researched in order to improve the accuracy of classification. In this paper, a margin-based optimization model, inspired by Support Vector Machine classifiers, is proposed to compute these fuzzy rule weights. This approach not only considers both accuracy and generalization criteria in a single objective fu...
متن کاملLinear Arithmetic with Stars
We consider an extension of integer linear arithmetic with a “star” operator takes closure under vector addition of the solution set of a linear arithmetic subformula. We show that the satisfiability problem for this extended language remains in NP (and therefore NP-complete). Our proof uses semilinear set characterization of solutions of integer linear arithmetic formulas, as well as a general...
متن کامل